Power Measures and Solutions for Games Under Precedence Constraints

Games under precedence constraints model situations, where players in a cooperative transferable utility game belong to some hierarchical structure, which is represented by an acyclic digraph (partial order). In this paper, we introduce the class of precedence power solutions for games under precedence constraints. These solutions are obtained by allocating the dividends in the game proportional to some power measure for acyclic digraphs. We show that all these solutions satisfy the desirable axiom of irrelevant player independence, which establishes that the payoffs assigned to relevant players are not affected by the presence of irrelevant players. We axiomatize these precedence power solutions using irrelevant player independence and an axiom that uses a digraph power measure. We give special attention to the hierarchical solution, which applies the hierarchical measure. We argue how this solution is related to the known precedence Shapley value, which does not satisfy irrelevant player independence, and thus is not a precedence power solution. We also axiomatize the hierarchical measure as a digraph power measure.     

Local Convergence Properties of Douglas–Rachford and Alternating Direction Method of Multipliers

The Douglas–Rachford and alternating direction method of multipliers are two proximal splitting algorithms designed to minimize the sum of two proper lower semi-continuous convex functions whose proximity operators are easy to compute. The goal of this work is to understand the local linear convergence behaviour of Douglas–Rachford (resp. alternating direction method of multipliers) when the involved functions (resp. their Legendre–Fenchel conjugates) are moreover partly smooth. More precisely, when the two functions (resp. their conjugates) are partly smooth relative to their respective smooth submanifolds, we show that Douglas–Rachford (resp. alternating direction method of multipliers) (i) identifies these manifolds in finite time; (ii) enters a local linear convergence regime. When both functions are locally polyhedral, we show that the optimal convergence radius is given in terms of the cosine of the Friedrichs angle between the tangent spaces of the identified submanifolds. Under polyhedrality of both functions, we also provide conditions sufficient for finite convergence. The obtained results are illustrated by several concrete examples and supported by numerical experiments.     

On Some Methods to Derive Necessary and Sufficient Optimality Conditions in Vector Optimization

The aim of this paper is to address new approaches, in separate ways, to necessary and, respectively, sufficient optimality conditions in constrained vector optimization. In this respect, for the necessary optimality conditions that we derive, we use a kind of vectorial penalization technique, while for the sufficient optimality conditions we make use of an appropriate scalarization method. In both cases, the approaches couple a basic technique (of penalization or scalarization, respectively) with several results in variational analysis and optimization obtained by the authors in the last years. These combinations allow us to arrive to optimality conditions which are, in terms of assumptions made, new.     

Existence of Solutions and Algorithms for Bilevel Vector Equilibrium Problems: An Auxiliary Principle Technique

The main goal of this paper is to introduce and study bilevel vector equilibrium problems. We first establish some existence results for solutions of vector equilibrium problems and mixed vector equilibrium problems. We study the existence of solutions of bilevel vector equilibrium problems by considering a vector Thikhonov-type regularization procedure. By using this regularization procedure and existence results for mixed vector equilibrium problems, we establish some existence results for solutions of bilevel vector equilibrium problems. By using the auxiliary principle, we propose an algorithm for finding the approximate solutions of bilevel vector equilibrium problems. The strong convergence of the proposed algorithm is also studied.     

Solving Internal Habit Formation Models Through Dynamic Programming in Infinite Dimension

In this paper, we study an economic model, where internal habits play a role. Their formation is described by a more general functional form than is usually assumed in the literature, because a finite memory effect is allowed. Indeed, the problem becomes the optimal control of a standard ordinary differential equation, with the past of the control entering both the objective function and an inequality constraint. Therefore, the problem is intrinsically infinite dimensional. To solve this model, we apply the dynamic programming approach and we find an explicit solution for the associated Hamilton–Jacobi–Bellman equation, which lets us write the optimal strategies in feedback form. Therefore, we contribute to the existing literature in two ways. Firstly, we fully develop the dynamic programming approach to a type of problem not studied in previous contributions. Secondly, we use this result to unveil the global dynamics of an economy characterized by generic internal habits.     

On “Pre-historic” Linear Programming and the Figure of the Earth

In this paper, we develop algorithms to solve generalized Fermat–Torricelli problems with both positive and negative weights and multifacility location problems involving distances generated by Minkowski gauges. We also introduce a new model of clustering based on squared distances to convex sets. Using the Nesterov smoothing technique and an algorithm for minimizing differences of convex functions introduced by Tao and An, we develop effective algorithms for solving these problems. We demonstrate the algorithms with a variety of numerical examples.     

Copositivity Detection of Tensors: Theory and Algorithm

A symmetric tensor is called copositive if it generates a multivariate form taking nonnegative values over the nonnegative orthant. Copositive tensors have found important applications in polynomial optimization, tensor complementarity problems and vacuum stability of a general scalar potential. In this paper, we consider copositivity detection of tensors from both theoretical and computational points of view. After giving several necessary conditions for copositive tensors, we propose several new criteria for copositive tensors based on the representation of the multivariate form in barycentric coordinates with respect to the standard simplex and simplicial partitions. It is verified that, as the partition gets finer and finer, the concerned conditions eventually capture all strictly copositive tensors. Based on the obtained theoretical results with the help of simplicial partitions, we propose a numerical method to judge whether a tensor is copositive or not. The preliminary numerical results confirm our theoretical findings.     

Potential operators associated with Hankel and Hankel-Dunkl transforms

We study Riesz and Bessel potentials in the settings of Hankel transform, modified Hankel transform and Hankel-Dunkl transform. We prove sharp or qualitatively sharp pointwise estimates of the corresponding potential kernels. Then we characterize those 1 ≤ p, q≤∞, for which the potential operators satisfy L ^p -L ^q estimates. In case of the Riesz potentials, we also characterize those 1 ≤ p, q ≤ ∞, for which two-weight L ^p -L ^q estimates, with power weights involved, hold. As a special case of our results, we obtain a full characterization of two power-weight L ^p -L ^q bounds for the classical Riesz potentials in the radial case. This complements an old result of Rubin and its recent reinvestigations by De Nápoli, Drelichman and Durán, and Duoandikoetxea.     

Generalised continuation by means of right limits

Several theories have been proposed to generalise the concept of analytic continuation to holomorphic functions of the disc for which the circle is a natural boundary. Elaborating on Breuer-Simon’s work on right limits of power series, Baladi-Marmi-Sauzin recently introduced the notion of renascent right limit and rrl-continuation. We discuss a few examples and consider particularly the classical example of Poincaré simple pole series in this light. These functions are represented in the disc as series of infinitely many simple poles located on the circle; they appear, for instance, in small divisor problems in dynamics. We prove that any such function admits a unique rrl-continuation, which coincides with the function obtained outside the disc by summing the simple pole expansion. We also discuss the relation with monogenic regularity in the sense of Borel.